An Improved Rate Monotonic Schedulability Test Algorithm
نویسندگان
چکیده
منابع مشابه
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests are used for on-line guarantee of dynamic systems, where tasks can be activated at runtime. These tests introd...
متن کاملAn Improved Schedulability Test for Uniprocessor Periodic Task Systems
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show analytically and empirically that this test is more accurate than the commonlyused density condition. We also present and discuss the results of experiments that compare the accurac...
متن کاملSchedulability Analysis for Rate-Monotonic Algorithm in Parallel Real-Time Systems
Content RateMonotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA on various systems, first it is essential to determine the system’s feasibility. Various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper, we develop an algorithm to compute the RMA schedulability in a parallel real-time...
متن کاملAn Improved Rate-Monotonic Admission Control and Its Applications
Rate-monotonic scheduling (RMS) is a widely used real-time scheduling technique. This paper proposes RBound, a new admission control for RMS. RBound has two interesting properties. First, it achieves high processor utilization under certain conditions. We show how to obtain these conditions in a multiprocessor environment and propose a multiprocessor scheduling algorithm that achieves a near op...
متن کاملAn Analysis of Deadline-Monotonic Schedulability on a Multiprocessor
A new schedulability test is presented for preemptive deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue m-server system. This generalizes and extends a result of Andersson, Baruah, and Jonsson, for the case where deadline equals period, which showed all deadlines will be met if the total utilization is at most m=(3m 1) and the utilization of each task is at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2005
ISSN: 1000-9825
DOI: 10.1360/jos160089